package com.kehao.leetcode.basic.others;

public class CountOfOneSolution {
    public int hammingWeight(int n) {
        int count = 0;
        while (n!=0){
            count+=n&1;
            n=n>>1;
        }
        return count;
    }
}
